Computable Subgroup Chains and Shadowing
نویسنده
چکیده
We present a new structural framework for computational group theory, based on chains of subgroups. This extends existing methods, such as Schreier-Sims techniques for permutation groups. This framework is now a part of the GAP 4 computational algebra system. It will be useful for implementing the matrix group recognition project.
منابع مشابه
LIMIT AVERAGE SHADOWING AND DOMINATED SPLITTING
In this paper the notion of limit average shadowing property is introduced for diffeomorphisms on a compact smooth manifold M and a class of diffeomorphisms is given which has the limit average shadowing property, but does not have the shadowing property. Moreover, we prove that for a closed f-invariant set Lambda of a diffeomorphism f, if Lambda is C1-stably limit average shadowing and t...
متن کاملCo-c.e. spheres and cells in computable metric spaces
We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable each co-computably enumerable sphere is computable and each co-c.e. cell with co-c.e. boundary sphere is computable.
متن کاملShadowing and Scaffolding Techniques Affecting L2 Reading Comprehension
Scaffolding and shadowing techniques have been shown to improve language learners’ reading comprehension. However, little attention has been paid to the comparative effectiveness of these techniques. This study investigated the effect of three selected scaffolding techniques (peer scaffolding, distributed scaffolding, and reciprocal scaffolding) versus three types of shadowing (complete shadowi...
متن کاملOn Periodic Shadowing Property
In this paper, some properties of the periodic shadowing are presented. It is shown that a homeomorphism has the periodic shadowing property if and only if so does every lift of it to the universal covering space. Also, it is proved that continuous mappings on a compact metric space with the periodic shadowing and the average shadowing property also have the shadowing property and then are chao...
متن کاملHow good and for how long: Scaling laws on validity of trajectories
Dynamical conditions for the loss of validity of numerical chaotic solutions of physical systems are already understood. However, the fundamental questions of “how good” and “for how long” the solutions are valid remained unanswered. This work answers these questions by establishing scaling laws for the shadowing distance and for the shadowing time in terms of physically meaningful quantities t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004